Robustly optimal rate one-half binary convolutional codes (Corresp.)

نویسنده

  • Rolf Johannesson
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Short binary convolutional codes with maximal free distance for rates 2/3 and 3/4 (Corresp.)

-A search procedure is developed to find good short binary (N,N 1) convolutional codes. It uses simple rules to discard from the complete ensemble of codes a large fraction whose free distance dfrce either cannot achieve the maximum value or is equal to dfree of some code in the remaining set. Further, the search among the remaining codes is started in a subset in which we expect the possibilit...

متن کامل

Design and Performance of Rate-Compatible Non-binary LDPC Convolutional Codes

In this paper, we present a construction method of non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an extension of Felström and Zigangirov construction [1] for non-binary LDPC convolutional codes. The rate-compatibility of the non-binary convolutional code is also discussed. The proposed rate-compatible code is designed from one single mother (2,4)-reg...

متن کامل

Terminated LDPC Convolutional Codes over GF(2)

In this paper, we present a construction method of terminated non-binary low-density parity-check (LDPC) convolutional codes. Our construction method is an expansion of Felstrom and Zigangirov construction [1] for non-binary LDPC convolutional codes. The rate-compatibility of the non-binary LDPC convolutional codes is also discussed. The proposed ratecompatible code is designed from one single ...

متن کامل

A class of binary rate one-half convolutional codes that allows an improved stack decoder

T HIS INTRODUCTORY section applies to general binary rate k/n convolutional codes. In Section II we specialize to rate one-half to describe a class of codes that allows an interesting mod ification of the stack decoding algorithm [l]-[2]. Section III presents our simulation results. Let G be a conventional convolutional encoder [3] whose rows are the first k rows of a polynomial n X n matrix B ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 21  شماره 

صفحات  -

تاریخ انتشار 1975